1 6 A ug 2 00 4 Singular 0 / 1 - matrices , and the hyperplanes spanned by random 0 / 1 - vectors
نویسندگان
چکیده
Let Ps(d) be the probability that a random 0/1-matrix of size d× d is singular, and let E(d) be the expected number of 0/1-vectors in the linear subspace spanned by d − 1 random independent 0/1-vectors. (So E(d) is the expected number of cube vertices on a random affine hyperplane spanned by vertices of the cube.) We prove that bounds on Ps(d) are equivalent to bounds on E(d): Ps(d) =
منابع مشابه
6 A ug 2 00 3 Singular 0 / 1 - matrices , and the hyperplanes spanned by random 0 / 1 - vectors
Let Ps(d) be the probability that a random 0/1-matrix of size d× d is singular, and let E(d) be the expected number of 0/1-vectors in the linear subspace spanned by d − 1 random independent 0/1-vectors. (So E(d) is the expected number of cube vertices on a random affine hyperplane spanned by vertices of the cube.) We prove that bounds on Ps(d) are equivalent to bounds on E(d): Ps(d) =
متن کاملec 2 00 8 Singular 0 / 1 - matrices , and the hyperplanes spanned by random 0 / 1 - vectors
Let Ps(d) be the probability that a random 0/1-matrix of size d× d is singular, and let E(d) be the expected number of 0/1-vectors in the linear subspace spanned by d − 1 random independent 0/1-vectors. (So E(d) is the expected number of cube vertices on a random affine hyperplane spanned by vertices of the cube.) We prove that bounds on Ps(d) are equivalent to bounds on E(d): Ps(d) =
متن کاملSingular 0/1-Matrices, and the Hyperplanes Spanned by Random 0/1-Vectors
Let Ps(d) be the probability that a random 0/1-matrix of size d× d is singular, and let E(d) be the expected number of 0/1-vectors in the linear subspace spanned by d − 1 random independent 0/1-vectors. (So E(d) is the expected number of cube vertices on a random affine hyperplane spanned by vertices of the cube.) We prove that bounds on Ps(d) are equivalent to bounds on E(d): Ps(d) =
متن کاملPreconditioning Legendre Spectral Collocation Approximations to Elliptic Problems
This work deals with the H1 condition numbers and the distribution of the ~ N;Msingular values of the preconditioned operators f~ 1 N;M WN;M ÂN;Mg. ÂN;M is the matrix representation of the Legendre Spectral Collocation discretization of the elliptic operator A de ned by Au := u + a1ux + a2uy + a0u in (the unit square) with boundary conditions: u = 0 on 0; @u @ A = u on 1. ~ N;M is the sti ness ...
متن کاملNon-Asymptotic Theory of Random Matrices Lecture 16: Invertibility of Gaussian Matrices and Compressible/Incompressible Vectors
We begin this lecture by asking why should an arbitrary n × n Gaussian matrix A be invertible? That is, does there exist a lower bound on the smallest singular value s n (A) = inf x∈S n−1 Ax 2 ≥ c √ n where c > 0 is an absolute constant. There are two reasons (or cases) which we will pursue in this lecture. 1. In Lecture 15 we saw that the invertibility of rectangular (i.e., non-square) Gaussia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004